Stochastic Automata Networks ( SAN ) - Modellingand

نویسندگان

  • Paulo Fernandes
  • Brigitte Plateau
چکیده

This article describes the use of Stochastic Automata Networks (SAN) as a modelling tool. A SAN model consists of some individual stochastic automata that act more or less independently of each other. An automata is represented by a number of states and probabilistic rules that govern the manner in which it moves from one state to the next. The state of a SAN is given by the state of each of its constituent automata. Although, any SAN model can be converted in a standard Markov chain where traditional solving methods can be applied, numerical solutions using the particular SAN properties can give faster results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Automata Networks (san) - Modelling and Evaluation

This article describes the use of Stochastic Automata Networks (SAN) as a modelling tool. A SAN model consists of some individual stochastic automata that act more or less independently of each other. An automata is represented by a number of states and probabilistic rules that govern the manner in which it moves from one state to the next. The state of a SAN is given by the state of each of it...

متن کامل

Optimizing Tensor Product Computations in Stochastic Automata Networks

In this paper we consider some numerical issues in computing solutions to networks of stochastic automata (SAN). In particular our concern is with keeping the amount of computation per iteration to a minimum, since iterative methods appear to be the most eeective in determining numerical solutions. In a previous paper we presented complexity results concerning the vector-descriptor multiplicati...

متن کامل

Graphs and Stochastic Automata Networks 1

We show how some graph theoretical arguments may be used to reduce the complexity of the computation of the steady-state distribution of Markov chain. We consider the directed graph associated to a Markov chain derived from a Stochastic Automata Network (SAN). The structural properties of the automata are used to establish new various results. First, we establish the complexity of the resolutio...

متن کامل

Preconditioning for Stochastic Automata Networks

LANGVILLE, AMY N. Preconditioning for Stochastic Automata Networks. (Under the direction of William J. Stewart.) Many very large Markov chains can be modeled efficiently as Stochastic Automata Networks (SANs). A SAN is composed of individual automata that, for the most part, act independently, requiring only infrequent interaction. SANs represent the generator matrix Q of the underlying Markov ...

متن کامل

MQNA - Markovian Queueing Networks Analyser

This paper describes the MQNA Markovian Queueing Networks Analyser, a software tool to model and obtain the stationary solution of a large class of Queueing Networks. MQNA can directly solve open and closed product-form queueing networks using classical algorithms. For finite capacity queueing models, MQNA generates Markovian description in the Stochastic Automata Networks (SAN) and Stochastic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007